Reducing the Blocking in Two-Phase Commit Protocol Employing Backup Sites

نویسندگان

  • P. Krishna Reddy
  • Masaru Kitsuregawa
چکیده

In distributed data base systems (DDBSs), a transaction blocks during two-phase commit (2PC) processing if the coordinator site fails and at the same time some participant site has declared itself ready to commit the transaction. The blocking phenomena reduces availability of the system since the blocked transactions keep all the resources until they receive the final command from the coordinator after its recovery. To remove the blocking problem in 2PC protocol, three phase commit (3PC) protocol was proposed. Although 3PC protocol eliminates the blocking problem, it involves an extra round of message transmission, which further degrades the performance of DDBSs. In this paper, we propose a backup commit (BC) protocol by including backup phase to 2PC protocol. In this, one backup site is attached to each coordinator site. After receiving responses from all participants in the first phase, the coordinator communicates its decision only to its backup site in the backup phase. Afterwards, it sends final decision to participants. When blocking occurs due to the failure of the coordinator site, the participant sites consult coordinator’s backup site and follow termination protocols. In this way, BC protocol achieves non-blocking property in most of the coordinator site failures. However, in the worst case, the blocking can occur in BC protocol when both the coordinator and its backup site fail simultaneously. If such a rare case occurs, the participants wait until the recovery of either the coordinator site or the backup site. BC protocol suits best for DDBS environments in which sites fail frequently and messages take longer delivery time. Through simulation experiments it has been shown that BC protocol exhibits superior throughput and response time performance over 3PC protocol and performs closely with 2PC protocol.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Efficient Non Blocking Two Phase Commit Protocol for Distributed Transactions

The 2-phase commit protocol is a standard algorithm for safeguarding the ACID properties of transaction in the distributed system. In distributed database systems (DDBSs), transaction blocks occurs during two-phase commit (2PC) processing if the coordinator itself fails and at the same time some client has declared itself ready to commit the transaction. Thus the blocking phenomena reduce the a...

متن کامل

Proxy based Two Phase Commit with Wait for Improved Response Time and Blocking Probability

Whereas the two-phase commit protocol guarantees global atomicity, its biggest drawback is that it is a blocking protocol whenever the coordinator fails, cohort sites will have to wait for its recovery. Although threephase commit protocol was devised to reduce blocking situation, it increases latency. In this paper we propose a proxy based two-phase atomic commitment protocol to improve the per...

متن کامل

Performance Analysis of Distributed Database Recovery Protocols

An early recovery protocol that was investigated at length and is currently implemented in most commercial Distributed Database Management System products is the two-phase commit protocol. However, there is one main drawback in using this, namely blocking, that is, operational sites having to wait for the recovery of a failed site in order to complete a transaction. The two-phase commit protoco...

متن کامل

Reducing the Latency of Non-Blocking Commitment using Optimism and Replication

Atomic commitment protocols are used to ensure the atomicity of atomic transactions. The best known and most widely used atomic commitment protocol is two phase commit (2PC). The main idea behind 2PC is to perform two rounds of voting under the guidance of a site acting as coordinator. The coordinator asks first for votes on whether to commit (yes vote) or abort (no vote) the transaction. The p...

متن کامل

Participant Intention - to - Commit Ack

The implicit yes{vote commit protocol (IYV), proposed for future gigabit{networked distributed databases, reduces the time required to commit a distributed transaction at the expense of independent recovery of failed participant sites. In this paper, we propose a novel coordination scheme for IYV that reduces the window of vulnerability to blocking and minimizes the time required for the sites ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998